Case Constraints and Empty Categories in Optimality Theory Parsing

نویسنده

  • Ron Artstein
چکیده

Double object questions are harder to process than the corresponding questions with prepositional objects (Boland 1997). When given the choice between the two, a parser prefers to wait and not associate a filler with a gap in a double object construction, contrary to the prediction of the Active Filler Hypothesis (Frazier 1987). I propose that the reason the parser holds back is that it wants to avoid a structure that has dative Case; this pressure is stronger than the pressure to associate a filler with a gap, which comes from the thematic requirements of elements in the sentence (and not from the cost of holding the filler in memory). The results are formulated in an extension to Stevenson and Smolensky’s (1997) Optimality Theory parser, as tension between constraints that mark Case and argument structure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Duality for vector equilibrium problems with constraints

‎In the paper‎, ‎we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior‎. ‎Then‎, ‎their applications to optimality conditions for quasi-relative efficient solutions are obtained‎. ‎Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...

متن کامل

Optionality and Gradience in Persian Phonology: An Optimality Treatment

The distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. An organized survey was conducted to elicit the judgments of 37 native Persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. The results showed that the differences in judgment between the various categories are not just t...

متن کامل

Optimality Theory and Human Sentence Processing

This paper applies the idea of a winner-take-all constraint satisfaction system like that found in Optimality Theory to human sentence parsing. Three sets of constraints, each of which is derived from a parsing theory from the current literature, are attempted. The empirical data considered here do not seem to be consistent with any of these theories. It is argued that a cumulative constraint w...

متن کامل

Chasing the ghost: recovering empty categories in the Chinese Treebank

Empty categories represent an important source of information in syntactic parses annotated in the generative linguistic tradition, but empty category recovery has only started to receive serious attention until very recently, after substantial progress in statistical parsing. This paper describes a unified framework in recovering empty categories in the Chinese Treebank. Our results show that ...

متن کامل

Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures

This paper describes an algorithm for computing optimal structural descriptions for Optimality Theory grammars with context-free position structures. This algorithm extends Tesar's dynamic programming approach (Tesar, 1994) (Tesar, 1995a) to computing optimal structural descriptions from regular to context-free structures. The generalization to contextfree structures creates several complicatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000